An optimal adaptive wavelet method for nonsymmetric and indefinite elliptic problems∗
نویسنده
چکیده
In this paper, we modify the adaptive wavelet algorithm from [Technical Report 1325, Department of Mathematics, Utrecht University, March 2005] so that it applies directly, i.e., without forming the normal equation, not only to self-adjoint elliptic operators but also to such operators to which generally nonsymmetric lower order terms are added, assuming that the resulting operator equation is well-posed. We show that the algorithm has optimal computational complexity.
منابع مشابه
Multigrid Algorithms for Nonconforming and Mixed Methods for Nonsymmetric and Indefinite Problems
In this paper we consider multigrid algorithms for nonconforming and mixed finite element methods for nonsymmetric and/or indefinite elliptic problems. We show that a simple V-cycle multigrid iteration using conforming coarse-grid corrections converges at a uniform rate provided that the coarsest level in the multilevel iteration is sufficiently fine (but independent of the number of multigrid ...
متن کاملIterative Schemes for Nonsymmetric and Indefinite Elliptic Boundary Value Problems
The purpose of this paper is twofold. The first is to describe some simple and robust iterative schemes for nonsymmetric and indefinite elliptic boundary value problems. The schemes are based in the Sobolev space Hl (ii) and require minimal hypotheses. The second is to develop algorithms utilizing a coarse-grid approximation. This leads to iteration matrices whose eigenvalues lie in the right h...
متن کاملTowards Automatic Multigrid Algorithms for SPD, Nonsymmetric and Indefinite Problems
A new multigrid algorithm is constructed for the solution of linear systems of equations which arise from the discretization of elliptic PDEs. It is defined in terms of the difference scheme on the fine grid only, and no rediscretization of the PDE is required. Numerical experiments show that this algorithm gives high convergence rates for several classes ofproblems: symmetric, nonsymmetdc and ...
متن کاملDomain Decomposition Algorithms for Indefinite Elliptic Problems
Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We first consider an additive Schwarz...
متن کاملAdaptive wavelet methods for saddle point problems
Recently, adaptive wavelet stratégies for symmetrie, positive definite operators have been introduced that were proven to converge. This paper is devoted to the generalization to saddle point problems which are also symmetrie, but indefinite. Firstly, we investigate a posteriori error estimâtes and generalize the known adaptive wavelet strategy to saddle point problems. The convergence of this ...
متن کامل